The accuracy of a parallel LU decomposition algorithm
نویسندگان
چکیده
منابع مشابه
Parallel LU Decomposition on a Transputer Network
A parallel algorithm is derived for LU decomposition with partial pivoting on a local-memory multiprocessor. A general Cartesian data distribution scheme is presented which contains many of the existing distribution schemes as special cases. This scheme is used to prove optimality of toad balance for the grid distribution. Experimental results of an implementation of the algorithm in occam-2 on...
متن کاملLU-Decomposition on a Massively Parallel Transputer System
Two algorithms for LU{decomposition on a transputer based reconngurable MIMD parallel computer with distributed memory have been analyzed in view of the interdependence of granularity and execution time. In order to investigate this experimentally, LU{decomposition algorithms have been implemented on a parallel computer, the Parsytec SuperCluster 128. The results of this investigation may be su...
متن کاملAn Improved Algorithm for Parallel Sparse LU Decomposition on a Distributed Memory Multiprocessor
In this paper we present a new parallel algorithm for the LU decomposition of a general sparse matrix Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the number of pivots produced Experimental results obtained on a network of transputers show that these features considerably improve the performance
متن کاملSequential Performance Versus Scalability: Optimizing Parallel LU-Decomposition
High e cient implementations of parallel algorithms need high e cient sequential kernels. Therefore, libraries like BLAS are successfully used in many numerical applications. In this paper we show the tradeo between the performance of these kernels and the scalability of parallel applications. It turns out that the fastest routine on a single node does not necessarily lead to the fastest parall...
متن کاملParallel Pivots LU Algorithm on the Cray T3E
Solving large nonsymmetric sparse linear systems on distributed memory multiprocessors is an active research area. We present a loop-level parallelized generic algorithm which comprises analyse-facto-rize and solve stages. To further exploit matrix sparsity and parallelism, the analyse step looks for a set of compatible pivots. Sparse techniques are applied until the reduced submatrix reaches a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1990
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90345-k